---
title: "L1-102 兰州牛肉面"
created: 2025-11-28
tags:
  - 算法
---

# L1-102 兰州牛肉面

## 题目 [L1-102 兰州牛肉面](https://pintia.cn/problem-sets/994805046380707840/exam/problems/type/7?problemSetProblemId=1781658570803388421&page=1)

![[image-684c8cf4.png]]

## 思路分析

## 代码实现

```cpp
#include<bits/stdc++.h>

using namespace std;

#define endl '\n'

using ll = long long;

using ull = unsigned long long;

using PII = pair<int,int>;

using Pll = pair<ll,ll>;

int dx[4]= {-1,0,1,0},dy[4]= {0,1,0,-1};

const int inf = 0x3f3f3f3f;

int main() {

	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);

	int n;cin>>n;

	vector<double> price(n+1);

	for(int i=1;i<=n;i++){

		cin>>price[i];

	}

	unordered_map<int,int> xiaoliang;

	double total=0;

	while(true){

		int bh,ws;cin>>bh>>ws;

		if(bh==0 && ws==0)	break;

		xiaoliang[bh]+=ws;

		total+=price[bh]*ws;

	}

	for(int i=1;i<=n;i++)	printf("%d\n",xiaoliang[i]);

	printf("%.2f",total);

	return 0;

}
```

## 同类题型

## 视频讲解

---
⬅️ [[L1-101 别再来这么多猫娘了！|L1-101 别再来这么多猫娘了！]] 🏠 [[00-天梯赛]] ➡️ [[L1-103 整数的持续性|L1-103 整数的持续性]]